Algorithms for Stochastic Games on Interference Channels

We consider a wireless channel shared by multiple transmitter-receiver pairs. Their transmissions interfere with each other. Each transmitter-receiver pair aims to maximize its long-term average transmission rate subject to an average power constraint. This scenario is modeled as a stochastic game. We provide sufficient conditions for existence and uniqueness of a Nash equilibrium (NE). We then formulate the problem of finding NE as a variational inequality (VI) problem and present an algorithm to solve the VI using regularization. We also provide distributed algorithms to compute Pareto optimal solutions for the proposed game

Power Allocation Games on Interference Channels with Complete and Partial Information

We consider a wireless channel shared by multiple transmitter-receiver pairs. Their transmissions interfere with each other. Each transmitter-receiver pair aims to maximize its long-term average transmission rate subject to an average power constraint. This scenario is modeled as a stochastic game under different assumptions. We first assume that each transmitter and receiver has knowledge of all direct and cross link channel gains. We later relax the assumption to the knowledge of incident channel gains and then further relax to the knowledge of the direct link channel gains only. In all the cases, we formulate the problem of finding the Nash equilibrium as a variational inequality (VI) problem and present an algorithm to solve the VI.Comment: arXiv admin note: text overlap with arXiv:1409.755

Resource Allocation in a MAC with and without security via Game Theoretic Learning

In this paper a $K$-user fading multiple access channel with and without security constraints is studied. First we consider a F-MAC without the security constraints. Under the assumption of individual CSI of users, we propose the problem of power allocation as a stochastic game when the receiver sends an ACK or a NACK depending on whether it was able to decode the message or not. We have used Multiplicative weight no-regret algorithm to obtain a Coarse Correlated Equilibrium (CCE). Then we consider the case when the users can decode ACK/NACK of each other. In this scenario we provide an algorithm to maximize the weighted sum-utility of all the users and obtain a Pareto optimal point. PP is socially optimal but may be unfair to individual users. Next we consider the case where the users can cooperate with each other so as to disagree with the policy which will be unfair to individual user. We then obtain a Nash bargaining solution, which in addition to being Pareto optimal, is also fair to each user. Next we study a $K$-user fading multiple access wiretap Channel with CSI of Eve available to the users. We use the previous algorithms to obtain a CCE, PP and a NBS. Next we consider the case where each user does not know the CSI of Eve but only its distribution. In that case we use secrecy outage as the criterion for the receiver to send an ACK or a NACK. Here also we use the previous algorithms to obtain a CCE, PP or a NBS. Finally we show that our algorithms can be extended to the case where a user can transmit at different rates. At the end we provide a few examples to compute different solutions and compare them under different CSI scenarios.Comment: 27 pages, 12 figures. Part of the paper was presented in 2016 IEEE Information theory and applicaitons (ITA) Workshop, San Diego, USA in Feb. 2016. Submitted to journa

Krasovskii's Passivity

In this paper we introduce a new notion of passivity which we call Krasovskii's passivity and provide a sufficient condition for a system to be Krasovskii's passive. Based on this condition, we investigate classes of port-Hamiltonian and gradient systems which are Krasovskii's passive. Moreover, we provide a new interconnection based control technique based on Krasovskii's passivity. Our proposed control technique can be used even in the case when it is not clear how to construct the standard passivity based controller, which is demonstrated by examples of a Boost converter and a parallel RLC circuit

Central Nervous System Activity of Ethanolic Extract of Canavalia Maritima Leaves.

The present study shade dried leaves of Canavalia maritima belonging to family Fabaceae having medicinally important active constituent is reviewed, with special emphasis on the biological activities. It has been studied to report on preliminary Phytochemical and pharmacological activities. The preliminary Phytochemical screening of the extract of Canavalia maritima leaves showed the presence of carbohydrates, glycosides, sterols, flavonoids, saponins, tannins, terpenoids and phenolic compounds. The alkaloids, tannins, terpenoids and glycosides are present in the extract which may possibly responsible for the psychopharmacological depression action Canavalia maritima

Differentiation and Passivity for Control of Brayton-Moser Systems

This paper deals with a class of Resistive-Inductive-Capacitive (RLC) circuits and switched RLC (s-RLC) circuits modeled in Brayton Moser framework. For this class of systems, new passivity properties using a Krasovskii's type Lyapunov function as storage function are presented. Consequently, the supply-rate is a function of the system states, inputs and their first time-derivatives. Moreover, after showing the integrability property of the port-variables, two simple control methodologies called output shaping and input shaping are proposed for regulating the voltage in RLC and s-RLC circuits. Global asymptotic convergence to the desired operating point is theoretically proved for both proposed control methodologies. Moreover, robustness with respect to load uncertainty is ensured by the input shaping methodology. The applicability of the proposed methodologies is illustrated by designing voltage controllers for DC-DC converters and DC networks